Nuprl Lemma : w-machine-constraint_wf 11,40

w:world{i:l}.
(i:Id, t:l:IdLnk. (isrcv(l;a(i;t)))  (destination(l) = i))
 (w-machine-constraint(w {i'}) 
latex


Definitionst  T, Msg(M), IdLnk, Id, w.M, f(a), x:A  B(x), P  Q, False, A, A  B, , {x:AB(x)} , , x:AB(x), x:AB(x), S  T, #$n, s(i;t).x, a(i;t), kind(a), isrcv(k), left + right, P  Q, Dec(P), b, b, P & Q, P  Q, tag(k), lnk(k), , s = t, , act(k), w.TA, islocal(k), Unit, kindcase(ka.f(a); l,t.g(l;t) ), valtype(i;a), Type, val(a), r + s, x.A(x), vartype(i;x), w.T, n+m, a < b, Void, type List, mlnk(m), source(l), m(i;t), outl(x), isl(x), A c B, , isnull(a), let x,y,z = a in t(x;y;z), w-automaton(T;TA;M), w-machine(w;i), World, destination(l), isrcv(l;a), w-machine-constraint(w)
Lemmasw-isrcvl wf, ldst wf, world wf, w-machine wf, w-automaton wf, w-T wf, nat wf, w-isnull wf, w-vartype wf, rationals wf, isl wf, outl wf, w-valtype wf, unit wf, w-m wf, lsrc wf, mlnk wf, Msg wf, IdLnk wf, le wf, Id wf, qadd wf, w-val wf, eqtt to assert, iff transitivity, eqff to assert, islocal wf, w-TA wf, actof wf, bool wf, subtype rel self, w-M wf, lnk wf, tagof wf, islocal-not-isrcv, not functionality wrt iff, assert of bnot, bnot wf, not wf, assert wf, decidable assert, isrcv wf, w-kind wf, w-a wf, w-s wf, int inc rationals

origin